Efficient Hierarchical Identity Based Encryption Scheme in the Standard Model

نویسندگان

  • Yanli Ren
  • Dawu Gu
چکیده

Constructing identity based schemes is one of the hot topics of current cryptography. Hierarchical identity based cryptography is a generalization of identity based encryption that mirrors an organizational hierarchy. It allows a root public key generator to distribute the workload by delegating public key generation and identity authentication to lower-level public key generators. Currently, there is no hierarchical identity based encryption scheme that is fully secure in the standard model, with short public parameters and a tight reduction. In this paper, we propose an anonymous hierarchical identity based encryption scheme based on the q-ABDHE problem that is fully secure in the standard model. The ciphertext size is independent of the level of the hierarchy. Moreover, our scheme has short parameters, high efficiency and a tight reduction.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Generalized Hierarchical Identity-Based Signcryption

In this paper, we propose a generic method to construct Hierarchical Identity-Based Signcryption scheme. Using this method, a Hierarchical Identity-Based Signcryption scheme can be converted from any Hierarchical Identity-Based Encryption scheme. Then, we give a concrete instantiation, which is the first constant-size fully secure hierarchical identity-based signcryption scheme in the standard ...

متن کامل

Short Hierarchical Identity-based Encryption in the Selective-ID Model

Recently Zhang et al. proposed a hierarchical identity-based encryption scheme which is the first efficient scheme where both ciphertexts and private keys achieve O(1)size, and is the best trade-off between private key size and ciphertext size at present. However, in this paper, it will be pointed out that their scheme exists an ambiguity or shortcoming which makes their scheme be insecure or n...

متن کامل

Anonymous Hierarchical Identity-Based Encryption (Without Random Oracles)

We present an identity-based cryptosystem that features fully anonymous ciphertexts and hierarchical key delegation. We give a proof of security in the standard model, based on the mild Decision Linear complexity assumption in bilinear groups. The system is efficient and practical, with small ciphertexts of size linear in the depth of the hierarchy. Applications include search on encrypted data...

متن کامل

Programmable Hash Functions in the Multilinear Setting

We adapt the concept of a programmable hash function (PHF, Crypto 2008) to a setting in which a multilinear map is available. This enables new PHFs with previously unachieved parameters. To demonstrate their usefulness, we show how our (standard-model) PHFs can replace random oracles in several well-known cryptographic constructions. Namely, we obtain standard-model versions of the BonehFrankli...

متن کامل

Practical Hierarchical Identity Based Encryption and Signature schemes Without Random Oracles

In this paper, we propose a Hierarchical Identity Based Encryption scheme that is proven secure under the strongest model of [5] directly, without relying on random oracles. The size of the ciphertext is a constant while the size of public parameters is independent to the number of bit representing an identity. It is the first in the literature to achieve such a high security level and space ef...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Informatica (Slovenia)

دوره 32  شماره 

صفحات  -

تاریخ انتشار 2008